Measurement optimization in the variational quantum eigensolver using a minimum clique cover
نویسندگان
چکیده
منابع مشابه
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
The only available combinatorial algorithm for the minimum weighted clique cover (mwcc) in claw-free perfect graphs is due to Hsu and Nemhauser [10] and dates back to 1984. More recently, Chudnovsky and Seymour [3] introduced a composition operation, strip-composition, in order to define their structural results for claw-free graphs; however, this composition operation is general and applies to...
متن کاملOptimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
Zhi-Cheng Yang,1 Armin Rahmani,2, 3 Alireza Shabani,4 Hartmut Neven,4 and Claudio Chamon1 1Physics Department, Boston University, Boston, Massachusetts 02215, USA 2Department of Physics and Astronomy and Quantum Matter Institute, University of British Columbia, Vancouver, British Columbia, Canada V6T 1Z4 3Department of Physics and Astronomy, Western Washington University, 516 High Street, Belli...
متن کاملOptimization of Unweighted Minimum Vertex Cover
The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out....
متن کاملOptimization of Thermalisation Loss in the Quantum Dot Solar Cells using a Finite Element Method
As thermalisation loss is the dominant loss process in the quantum dot intermediate band solar cells (QD-IBSCs), it has been investigated and calculated for a QD-IBSC, where IB is created by embedding a stack of InAs(1-x) Nx QDs with a square pyramid shape in the intrinsic layer of the AlPySb(1-y) p-i-n structure. IB, which is an optically coupled but electrically isolated mini-band, divides th...
متن کاملMinimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
We give new algorithms for the minimum (weighted) clique cover in a claw-free perfect graph G, improving the complexity from O(|V (G)|) to O(|V (G)|). The new algorithms build upon neat reformulations of the problem: it basically reduces either to solving a 2-SAT instance (in the unweighted case) or to testing if a polyhedra associated with the edge-vertex incidence matrix of a bidirected graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2020
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.5141458